t = int(input())
for _ in range(t):
n, q = map(int, input().split())
final_sum = 0
num_even = 0
num_odd = 0
for x in (input().split()):
x = int(x)
final_sum += x
if x % 2:
num_odd += 1
num_even = n - num_odd
for i in range(q):
type, to_add = map(int, input().split())
if type == 0:
final_sum += to_add * num_even
if to_add % 2:
num_odd += num_even
num_even = 0
else:
final_sum += to_add * num_odd
if to_add % 2:
num_even += num_odd
num_odd = 0
print(final_sum)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n, q, ch = 0, nch = 0;
long long sum = 0;
cin >> n >> q;
vector<int> a;
vector<int> type;
vector<int> k;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
a.push_back(x);
sum += x;
}
for(int i = 0; i < q; i++)
{
int x, y;
cin >> x >> y;
type.push_back(x);
k.push_back(y);
}
for(int i = 0; i < n; i++)
{
if (a[i] % 2 == 0) ch++;
else nch++;
}
for(int i = 0; i < q; i++)
{
if(type[i] == 1) sum += nch * k[i];
else sum += ch * k[i];
if(k[i] % 2 != 0 && type[i] == 0) {nch += ch; ch = 0;}
if(k[i] % 2 != 0 && type[i] == 1) {ch += nch; nch = 0;}
cout << sum << endl;
}
}
}
1649B - Game of Ball Passing | 572A - Arrays |
1455A - Strange Functions | 1566B - MIN-MEX Cut |
678C - Joty and Chocolate | 1352E - Special Elements |
1520E - Arranging The Sheep | 1157E - Minimum Array |
1661D - Progressions Covering | 262A - Roma and Lucky Numbers |
1634B - Fortune Telling | 1358A - Park Lighting |
253C - Text Editor | 365B - The Fibonacci Segment |
75A - Life Without Zeros | 1519A - Red and Blue Beans |
466A - Cheap Travel | 659E - New Reform |
1385B - Restore the Permutation by Merger | 706A - Beru-taxi |
686A - Free Ice Cream | 1358D - The Best Vacation |
1620B - Triangles on a Rectangle | 999C - Alphabetic Removals |
1634C - OKEA | 1368C - Even Picture |
1505F - Math | 1473A - Replacing Elements |
959A - Mahmoud and Ehab and the even-odd game | 78B - Easter Eggs |